Annotated hypergraphs: models and applications
نویسندگان
چکیده
منابع مشابه
1 Directed Hypergraphs and Applications ( * )
We deal with directed hypergraphs as a tool to model and solve some classes of problems arising in Operations Research and in Computer Science. Concepts such as connectivity, paths and cuts are defined. An extension of the main duality results to a special class of hypergraphs is presented. Algorithms to perform visits of hypergraphs and to find optimal paths are studied in detail. Some applica...
متن کاملRandom hypergraphs and their applications
In the last few years we have witnessed the emergence, primarily in online communities, of new types of social networks that require for their representation more complex graph structures than have been employed in the past. One example is the folksonomy, a tripartite structure of users, resources, and tags-labels collaboratively applied by the users to the resources in order to impart meaningf...
متن کاملSparse hypergraphs with applications in combinatorial rigidity
A hypergraph H = (V,E) is called (1, k)-sparse, for some integer k, if each subset X ⊆ V with |X| ≥ k spans at most |X| − k hyperedges. If we also have |E| = |V | − k then H is (1, k)-tight. Hypergraphs of this kind occur in several problems of combinatorial rigidity, where the goal is to analyse the generic rigidity properties of point sets equipped with geometric constraints involving subsets...
متن کاملThe uniformity space of hypergraphs and its applications
Let H = (V,E) be a hypergraph, and let F be a field. A function f : V → F is called stable if for each e ∈ E, the sum of the values of f on the members of e is the same. The linear space consisting of the stable functions, denoted by U(H,F ), is called the uniformity space of H over F . The dimension of U(H,F ), denoted by udim(H,F ), is called the uniformity dimension of H over F . The concept...
متن کاملExtremal problems for colorings of simple hypergraphs and applications
The paper deals with extremal problems concerning colorings of hypergraphs. By using a random recoloring algorithm we show that any n-uniform simple hypergraph H with maximum edge degree at most Δ(H) ≤ c ·nrn−1, is r-colorable, where c > 0 is an absolute constant. As an application of our proof technique we establish a new lower bound for the Van der Waerden number W (n, r).
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applied Network Science
سال: 2020
ISSN: 2364-8228
DOI: 10.1007/s41109-020-0252-y